A HMM-Based Location Prediction Framework with Location Recognizer Combining k-Nearest Neighbor and Multiple Decision Trees

نویسندگان

  • Yong-Joong Kim
  • Sung-Bae Cho
چکیده

Knowing user’s current or next location is very important task for context-aware services in mobile environment. Many researchers have tried to predict user location using their own methods. However, they focused mainly the performance of method, and only few were considered development of real working system on mobile devices. In this paper, we present a location prediction framework, and develop a personalized destination prediction system based on this framework using smartphone. The framework consists of two methods of recognizing user location based on the combined method of k-nearest neighbor (kNN) and decision tree, and predicting user destination based on the hidden Markov model (HMM). The destination prediction system is composed of four parts including mobile sensor log collector, location recognition module, location prediction module, and system management module. Experiments on real datasets of five persons showed that our method achieved average prediction accuracy above 87%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

کاربرد شاخص‌های نزدیک‌ترین همسایه در شاخه‌زادهای بلوط ایرانی (Quercus brantii var. persica) جنگل‌های زاگرس

The ecological relationship between trees is important in the sustainable management of forests. Studying this relationship in spatial ecology, different indices are applied that are based on distance to nearest neighbor. The aim of this research was introduction of important indices based on nearest neighbor analysis and their application in the investigation of ecological relationship between...

متن کامل

Evaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests

Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...

متن کامل

Evaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests

Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...

متن کامل

A comparison of stacking with MDTs to bagging, boosting, and other stacking methods

In this paper, we present an integration of the algorithm MLC4.5 for learning meta decision trees (MDTs) into the Weka data mining suite. MDTs are a method for combining multiple classifiers. Instead of giving a prediction, MDT leaves specify which classifier should be used to obtain a prediction. The algorithm is based on the C4.5 algorithm for learning ordinary decision trees. An extensive pe...

متن کامل

Combining Nearest Neighbor Classi ers Through Multiple

Combining multiple classiiers is an eeective technique for improving accuracy. There are many general combining algorithms, such as Bagging or Error Correcting Output Coding, that signiicantly improve classiiers like decision trees, rule learners, or neural networks. Unfortunately, many combining methods do not improve the nearest neighbor classiier. In this paper, we present MFS, a combining a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013